Shuffle Invariance of the Super-RSK Algorithm
نویسندگان
چکیده
منابع مشابه
Super Rsk - Algorithms and Super
We construct the analogue of the plactic monoid for the super semistandard Young tableaux over a signed alphabet. This is done by developing a generalization of the Knuth's relations. Moreover we get generalizations of Greene's invariants and Young-Pieri rule. A generalization of the symmetry theorem in the signed case is also obtained. Except for this last result, all the other results are pro...
متن کاملThe super connectivity of shuffle-cubes
The shuffle-cube SQn, where n ≡ 2 (mod 4), a new variation of hypercubes proposed by Li et al. [T.-K. Li, J.J.M. Tan, L.-H. Hsu, T.-Y. Sung, The shuffle-cubes and their generalization, Inform. Process. Lett. 77 (2001) 35–41], is an n-regular n-connected graph. This paper determines that the super connectivity of SQn is 2n − 4 and the super edge-connectivity is 2n− 2 for n 6. 2005 Elsevier B.V...
متن کاملBiased Riffle Shuffles, Quasisymmetric Functions, and the Rsk Algorithm
This paper highlights the connections between riffle shuffles and symmetric functions. We analyze the effect of a riffle shuffle followed by the RSK algorithm on the resulting permutation. The theory of shuffling also allows us to deduce certain quasisymmetric function identities. Finally, we present a result about the eigenvalues of the Markov chain induced by riffle shuffles.
متن کاملCacheShuffle: An Oblivious Shuffle Algorithm Using Caches
We introduce the notion of K-Oblivious Shuffling, a refinement of the Oblivious Shuffling problem. The goal of a K-Oblivious Shuffling algorithm is to obliviously shuffle N encrypted blocks that have been randomly allocated on the server in such a way that the adversary learns nothing about the new allocation of blocks to storage, even if the adversary has learned the position of K touched bloc...
متن کاملBinar Shuffle Algorithm: Shuffling Bit by Bit
Frequently, randomly organized data is needed to avoid an anomalous operation of other algorithms and computational processes. An analogy is that a deck of cards is ordered within the pack, but before a game of poker or solitaire the deck is shuffled to create a random permutation. Shuffling is used to assure that an aggregate of data elements for a sequence S is randomly arranged, but avoids a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Mathematics
سال: 2002
ISSN: 0196-8858
DOI: 10.1006/aama.2001.0767